An improvised collocation algorithm to solve generalized Burgers’–Huxley equation
نویسندگان
چکیده
Abstract In the proposed work, an improvised collocation technique with cubic B-spline as basis functions is applied to obtain numerical solution of non-linear generalized Burgers’–Huxley equation, which has application in soliton theory. this technique, posteriori corrections are made interpolant and its higher-order derivatives, leads enhancement order convergence spatial domain. The temporal domain discretized using a weighted finite difference scheme, at each time level method. stability analysis carried out von Neumann scheme found be unconditionally stable. theoretical proof discussed detail Green’s function approach. $$L_{2}$$ L 2 , $$L_{\infty }$$ ∞ absolute error norms calculated well compared results available literature, shows improvement efficacy over existing ones.
منابع مشابه
Simulink Approach to Solve Fuzzy Differential Equation under Generalized Differentiability
In this paper, solution of fuzzy differential equation under general differentiability is obtained by simulink. The simulink solution is equivalent or very close to the exact solution of the problem. Accuracy of the simulink solution to this problem is qualitatively better. An illustrative numerical example is presented for the proposed method. Keywords—Fuzzy differential equation, Generalized ...
متن کاملHow to Solve an Operator Equation
MAI2TIN MATHILU This article summarizes a series of lectures clelivered at the Matherna.tics Departrnent of the University of Leipzig, Cerinany in April 1991, which were te overview teclrniques for solving operator ecluations en C*-algebras connected with methocis developed in a Spanish-Gerrnan research project en "Structure ancí Applications of C*-Algebras oí' Quotients" (SACA) . One of the re...
متن کاملGeneralized Laguerre Polynomials Collocation Method for Solving Lane-Emden Equation
In this paper we propose, a collocation method for solving nonlinear singular Lane-Emden equation which is a nonlinear ordinary differential equation on semi-infnite interval. This approach is based on a generalized Laguerre polynomial collocation method. This method reduces the solution of this problem to the solution of a system of algebraic equations.We also present the comparison of this wo...
متن کاملAn Algorithm to Solve a Linear Program
This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear program. This algorithm is built on simple concepts such as the slope and the intercept of a line. The core idea of the algorithm is the Deleting Principle based on the consistency between slopes and intercepts along the...
متن کاملUsing an Algorithm Portfolio to Solve Sokoban
The game of Sokoban is an interesting platform for algorithm research. It is hard for humans and computers alike. Even with its simple rules and small average level sizes there are levels that take a lot of computation for all known algorithms. In this thesis we will combine different Sokoban solvers with different domain specific enhancements into one portfolio. This portfolio can then be run ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arabian Journal of Mathematics
سال: 2022
ISSN: ['2193-5343', '2193-5351']
DOI: https://doi.org/10.1007/s40065-022-00359-z